Relative Adjacencies in Spatial Pseudo-Partitions
نویسندگان
چکیده
Introduction Qualitative spatial reasoning is a valid support for inferring relationships in geographical spaces. In particular, qualitative inferences are cognitively more expressive than quantitative ones, and support reasoning mechanisms in the absence of complete spatial knowledge (Cohn 1997). In geographical space, reasoning on spatial entities is supported by representations that mainly involve topological (Pullar and Egenhofer 1988, Egenhofer 1991, Randell et al. 1992, Clementini et al. 1993, Cui et al.1993) and direction relationships (Freksa 1992, Frank 1996, Sharma 1996, Papadias and Egenhofer 1997, Goyal and Egenhofer, 2000). Those spatial relationships provide useful mechanisms to evaluate the mutual relationships of regions over space. An effective data structure for modelling geographical spaces is based on a partition of space, thus forming a coverage derived from thematic classification (Robinson et al. 1984, Frank et al. 1997). Topological relationships in spatial partitions are mainly based on two operators: adjacency and disjunction. But these operators do not provide many capabilities to qualify the relationships between the regions forming a spatial partition. Alternatives include spatial statistic operators that estimate the spatial variability of a property but not the way elements of this distribution are interrelated. We believe that in many situations there is an interest in analysing how two given regions are in relation one with respect to the other. This should also help to identify local and global structural patterns in a spatial partition.
منابع مشابه
Asymptotic Behavior of the Average of the Adjacencies of the Topological Entities in Some Simplex Partitions
In this communication a general kind of simplex partitions are studied. These partitions are associated to some recurrence relations. The study of these equations lead us to set some properties in 2D and 3D about the average adjacencies of the topological entities defining the mesh, when the number of refinements tends to infinite. We prove that this limit is independent of the considered parti...
متن کاملSingletons and adjacencies of set partitions of type B
We show that the joint distribution of the number of singleton pairs and the number of adjacency pairs is symmetric over the set partitions of type Bn without zero-block, in analogy with the result of Callan for ordinary partitions.
متن کاملImproving Unstructured Mesh Partitions for Multiple Criteria Using Mesh Adjacencies
The scalability of unstructured mesh based applications depends on partitioning methods that quickly balance the computational work while reducing communication costs. Zhou et al. demonstrated the combination of (hyper)graph methods with vertex and element partition improvement for PHASTA computational fluid dynamics scaling to hundreds of thousands of processes. Our work generalizes partition ...
متن کاملCommutative pseudo BE-algebras
The aim of this paper is to introduce the notion of commutative pseudo BE-algebras and investigate their properties.We generalize some results proved by A. Walendziak for the case of commutative BE-algebras.We prove that the class of commutative pseudo BE-algebras is equivalent to the class of commutative pseudo BCK-algebras. Based on this result, all results holding for commutative pseudo BCK-...
متن کاملPseudo Boolean Programming for Partially Ordered Genomes
Comparing genomes of different species is a crucial problem in comparative genomics. Different measures have been proposed to compare two genomes: number of common intervals, number of adjacencies, number of reversals, etc. These measures are classically used between two totally ordered genomes. However, genetic mapping techniques often give rise to different maps with some unordered genes. Sta...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003